Non-Gödel Negation Makes Unwitnessed Consistency Undecidable
نویسندگان
چکیده
Recent results show that ontology consistency is undecidable for a wide variety of fuzzy Description Logics (DLs). Most notably, undecidability arises for a family of inexpressive fuzzy DLs using only conjunction, existential restrictions, and residual negation, even if the ontology itself is crisp. All those results depend on restricting reasoning to witnessed models. In this paper, we show that ontology consistency for inexpressive fuzzy DLs using any t-norm starting with the Łukasiewicz t-norm is also undecidable w.r.t. general models.
منابع مشابه
Gödel Negation Makes Unwitnessed Consistency Crisp
Ontology consistency has been shown to be undecidable for a wide variety of fairly inexpressive fuzzy Description Logics (DLs). In particular, for any t-norm “starting with” the Lukasiewicz t-norm, consistency of crisp ontologies (w.r.t. witnessed models) is undecidable in any fuzzy DL with conjunction, existential restrictions, and (residual) negation. In this paper we show that for any t-norm...
متن کاملArithmetical Foundations - Recursion. Evaluation. Consistency
Recursive maps, nowadays called primitive recursive maps, PR maps, have been introduced by Gödel in his 1931 article for the arithmetisation, gödelisation, of metamathematics. For construction of his undecidable formula he introduces a nonconstructive, non-recursive predicate beweisbar, provable. Staying within the area of categorical free-variables theory PR of primitive recursion or appropria...
متن کاملGödel : The Completeness and Incompleteness The - orems Kurt
Gödel: The Completeness and Incompleteness Theorems Kurt Gödel (1906–1978) 1930-The completeness of first-order logic 1931-On formally undecidable statements of Principia Mathematica and related systems I Gödel's first paper proves the completeness of the axioms and rules of first-order logic, essentially as given in Hilbert and Ackermann. There has been much discussion as to why Skolem (or Her...
متن کاملOn the Classical Content of Monadic G∼ and its Application to a Fuzzy Medical Expert System
The satisfiability problem for monadic infinite-valued Gödel logic is known to be undecidable. We identify a fragment of this logic extended with strong negation whose satisfiability is not only decidable but it is decidable within classical logic. We use this fragment to formalize the rules of CADIAG-2, a well performing fuzzy expert system assisting in the differential diagnosis in internal m...
متن کاملTruth Values and Connectives in Some Non-Classical Logics
The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...
متن کامل